Mathematicians of Gaussian Elimination

نویسنده

  • Joseph F. Grcar
چکیده

G aussian elimination is universally known as “the” method for solving simultaneous linear equations. As Leonhard Euler remarked, it is the most natural way of proceeding (“der natürlichste Weg” [Euler, 1771, part 2, sec. 1, chap. 4, art. 45]). Because Gaussian elimination solves linear problems directly, it is an important technique in computational science and engineering, through which it makes continuing, albeit indirect, contributions to advancing knowledge and to human welfare. What is natural depends on the context, so the algorithm has changed many times with the problems to be solved and with computing technology. Gaussian elimination illustrates a phenomenon not often explained in histories of mathematics. Mathematicians are usually portrayed as “discoverers”, as though progress is a curtain that gradually rises to reveal a static edifice which has been there all along awaiting discovery. Rather, Gaussian elimination is living mathematics. It has mutated successfully for the last two hundred years to meet changing social needs. Many people have contributed to Gaussian elimination, including Carl Friedrich Gauss. His method for calculating a special case was adopted by professional hand computers in the nineteenth century. Confusion about the history eventually made Gauss not only the namesake but also the originator of the subject. We may write Gaussian elimination to honor him without intending an attribution. This article summarizes the evolution of Gaussian elimination through the middle of the twentieth century [Grcar, 2011a,b]. The sole development in ancient times was in China. An independent origin in modern Europe has had three phases. First came the schoolbook lesson, beginning with Isaac Newton. Next were methods for professional hand computers, which began with Gauss, who apparently was inspired by work of JosephLouis Lagrange. Last was the interpretation in matrix algebra by several authors, including John

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing a block incomplete LU preconditioner as the by-product of block left-looking A-biconjugation process

In this paper, we present a block version of incomplete LU preconditioner which is computed as the by-product of block A-biconjugation process. The pivot entries of this block preconditioner are one by one or two by two blocks. The L and U factors of this block preconditioner are computed separately. The block pivot selection of this preconditioner is inherited from one of the block versions of...

متن کامل

Computation of determinant

where Sn (also known as the symmetric group on n elements) is the set of all permutations of {1, 2, . . . , n}, i.e., all the ways of pairing up the n rows of the matrix with the n columns, and I(π) is the inversion number of π, the minimal number of transpositions of adjacent columns needed to turn π into the identity permutation. This formula [1] is practical for some simple matrices such as ...

متن کامل

Islamic Architects and Islamic Mathematicians Artistics Meeting, To Utilize Geometry in Architecture The period under study is the fourth to the eleventh AH

In specialized topics of aesthetics, structure and function, the buildings of Islamic architecture in Iran during certain periods, show the strong presence of intellectual sciences such as mathematics. The use of geometry as a part of the science of numerical mathematics, which in its intellectual position has complex calculations, indicates the connection of Islamic architects with the mathema...

متن کامل

A numerical algorithm for solving a class of matrix equations

In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$  by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011